Toppling kings in multipartite tournaments by introducing new kings
نویسندگان
چکیده
منابع مشابه
On the 3-kings and 4-kings in multipartite tournaments
Koh and Tan gave a sufficient condition for a 3-partite tournament to have at least one 3-king in [K.M. Koh, B.P. Tan, Kings in multipartite tournaments, Discrete Math. 147 (1995) 171–183, Theorem 2]. In Theorem 1 of this paper, we extend this result to n-partite tournaments, where n 3. In [K.M. Koh, B.P. Tan, Number of 4-kings in bipartite tournaments with no 3-kings, Discrete Math. 154 (1996)...
متن کاملKings in semicomplete multipartite digraphs
A digraph obtained by replacing each edge of a complete p-partite graph by an arc or a pair of mutually opposite arcs with the same end vertices is called a semicom-plete p-partite digraph, or just a semicomplete multipartite digraph. A semicomplete multipartite digraph with no cycle of length two is a multipartite tournament. In a digraph D, an r-king is a vertex q such that every vertex in D ...
متن کاملFixing Tournaments for Kings, Chokers, and More
We study the tournament fixing problem (TFP), which asks whether a tournament organizer can rig a single-elimination (SE) tournament such that their favorite player wins, simply by adjusting the initial seeding. Prior results give two perspectives of TFP: on the one hand, deciding whether an arbitrary player can win any SE tournament is known to be NP-complete; on the other hand, there are a nu...
متن کاملMedians of Graphs and Kings of Tournaments*
We first prove that for any graph G with a positive vertex weight function w, there exists a graph H with a positive weight function w′ such that w(v) = w′(v) for all vertices v in G and whose w′-median is G. This is a generalization of a previous result for the case in which all weights are 1. The second result is that for any n-tournament T without transmitters, there exists an integer m ≤ 2n...
متن کاملSearching for Sorted Sequences of Kings in Tournaments
A tournament Tn is an orientation of a complete graph on n vertices. A king in a tournament is a vertex from which every other vertex is reachable by a path of length at most 2. A sorted sequence of kings in a tournament Tn is an ordered list of its vertices u1, u2, . . . , un such that ui dominates ui+1 (ui → ui+1) and ui is a king in the subtournament induced by {uj : i ≤ j ≤ n} for each i = ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2010
ISSN: 0012-365X
DOI: 10.1016/j.disc.2010.06.001